Precise subtyping for synchronous multiparty sessions

The notion of subtyping has gained an important role both in theoretical and applicative domains: in lambda and concurrent calculi as well as in programming languages. The soundness and the completeness, together referred to as the preciseness of subtyping, can be considered from two different points of view: operational and denotational. The former preciseness has been recently developed with respect to type safety, i.e. the safe replacement of a term of a smaller type when a term of a bigger type is expected. The latter preciseness is based on the denotation of a type which is a mathematical object that describes the meaning of the type in accordance with the denotations of other expressions from the language. The result of this paper is the operational and denotational preciseness of the subtyping for a synchronous multiparty session calculus. The novelty of this paper is the introduction of characteristic global types to prove the operational completeness

Resource control and intersection types: an intrinsic connection

In this paper we investigate the $\lambda$ -calculus, a $\lambda$-calculus enriched with resource control. Explicit control of resources is enabled by the presence of erasure and duplication operators, which correspond to thinning and con-traction rules in the type assignment system. We introduce directly the class of $\lambda$ -terms and we provide a new treatment of substitution by its decompo-sition into atomic steps. We propose an intersection type assignment system for $\lambda$ -calculus which makes a clear correspondence between three roles of variables and three kinds of intersection types. Finally, we provide the characterisation of strong normalisation in $\lambda$ -calculus by means of an in-tersection type assignment system. This process uses typeability of normal forms, redex subject expansion and reducibility method.Comment: arXiv admin note: substantial text overlap with arXiv:1306.228

Denotational and operational preciseness of subtyping: A roadmap

The notion of subtyping has gained an important role both in theoretical and applicative domains: in lambda and concurrent calculi as well as in object-oriented programming languages. The soundness and the completeness, together referred to as the preciseness of subtyping, can be considered from two different points of view: denotational and operational. The former preciseness is based on the denotation of a type, which is a mathematical object describing the meaning of the type in accordance with the denotations of other expressions from the language. The latter preciseness has been recently developed with respect to type safety, i.e. the safe replacement of a term of a smaller type when a term of a bigger type is expected. The present paper shows that standard proofs of operational preciseness imply denotational preciseness and gives an overview on this subject

Precise subtyping for asynchronous multiparty sessions

Session subtyping is a cornerstone of refinement of communicating processes: a process implementing a session type (i.e., a communication protocol) T can be safely used whenever a process implementing one of its supertypes T0 is expected, in any context, without introducing deadlocks nor other communication errors. This paper presents the first formalisation of the precise subtyping relation for asynchronous multiparty sessions: we show that the relation is sound (i.e., guarantees safe process replacement, as outlined above) and also complete: any extension of the relation is unsound. Previous work studies precise subtyping for binary sessions (with two participants), or multiparty sessions (with any number of participants) and synchronous interaction. Here, we cover multiparty sessions with asynchronous interaction, where messages are transmitted via FIFO queues (as in the TCP/IP protocol). In this setting, the subtyping relation becomes highly complex: under some conditions, participants can permute the order of their inputs and outputs, by sending some messages earlier, or receiving some later, without causing errors; the precise subtyping relation must capture all such valid permutations, and consequently, its formalisation and proofs become challenging. Our key discovery is a methdology to decompose session types into single input/output session trees, and then express the subtyping relation as a composition of refinement relations between such trees

Precise subtyping for asynchronous multiparty sessions

Session subtyping is a cornerstone of refinement of communicating processes: a process implementing a session type (i.e., a communication protocol) T can be safely used whenever a process implementing one of its supertypes T′ is expected, in any context, without introducing deadlocks nor other communication errors. As a consequence, whenever T T′ holds, it is safe to replace an implementation of T′ with an implementation of the subtype T, which may allow for more optimised communication patterns. We present the first formalisation of the precise subtyping relation for asynchronous multiparty sessions. We show that our subtyping relation is sound (i.e., guarantees safe process replacement, as outlined above) and also complete: any extension of the relation is unsound. To achieve our results, we develop a novel session decomposition technique, from full session types (including internal/external choices) into single input/output session trees (without choices). Previous work studies precise subtyping for binary sessions (with just two participants), or multiparty sessions (with any number of participants) and synchronous interaction. Here, we cover multiparty sessions with asynchronous interaction, where messages are transmitted via FIFO queues (as in the TCP/IP protocol), and prove that our subtyping is both operationally and denotationally precise. In the asynchronous multiparty setting, finding the precise subtyping relation is a highly complex task: this is because, under some conditions, participants can permute the order of their inputs and outputs, by sending some messages earlier or receiving some later, without causing errors; the precise subtyping relation must capture all such valid permutations — and consequently, its formalisation, reasoning and proofs become challenging. Our session decomposition technique overcomes this complexity, expressing the subtyping relation as a composition of refinement relations between single input/output trees, and providing a simple reasoning principle for asynchronous message optimisations

cExternal beam radiation results in minimal changes in post void residual urine volumes during the treatment of clinically localized prostate cancer

<p>Abstract</p> <p>Background</p> <p>To evaluate the impact of external beam radiation therapy (XRT) on weekly ultrasound determined post-void residual (PVR) urine volumes in patients with prostate cancer.</p> <p>Methods</p> <p>125 patients received XRT for clinically localized prostate cancer. XRT was delivered to the prostate only (n = 66) or if the risk of lymph node involvement was greater than 10% to the whole pelvis followed by a prostate boost (n = 59). All patients were irradiated in the prone position in a custom hip-fix mobilization device with an empty bladder and rectum. PVR was obtained at baseline and weekly. Multiple clinical and treatment parameters were evaluated as predictors for weekly PVR changes.</p> <p>Results</p> <p>The mean patient age was 73.9 years with a mean pre-treatment prostate volume of 53.3 cc, a mean IPSS of 11.3 and a mean baseline PVR of 57.6 cc. During treatment, PVR decreased from baseline in both cohorts with the absolute difference within the limits of accuracy of the bladder scanner. Alpha-blockers did not predict for a lower PVR during treatment. There was no significant difference in mean PVR urine volumes or differences from baseline in either the prostate only or pelvic radiation groups (p = 0.664 and p = 0.458, respectively). Patients with a larger baseline PVR (>40 cc) had a greater reduction in PVR, although the greatest reduction was seen between weeks one and three. Patients with a small PVR (<40 cc) had no demonstrable change throughout treatment.</p> <p>Conclusion</p> <p>Prostate XRT results in clinically insignificant changes in weekly PVR volumes, suggesting that radiation induced bladder irritation does not substantially influence bladder residual urine volumes.</p

Systematisation of spatial uncertainties for comparison between a MR and a CT-based radiotherapy workflow for prostate treatments

<p>Abstract</p> <p>Background</p> <p>In the present work we compared the spatial uncertainties associated with a MR-based workflow for external radiotherapy of prostate cancer to a standard CT-based workflow. The MR-based workflow relies on target definition and patient positioning based on MR imaging. A solution for patient transport between the MR scanner and the treatment units has been developed. For the CT-based workflow, the target is defined on a MR series but then transferred to a CT study through image registration before treatment planning, and a patient positioning using portal imaging and fiducial markers.</p> <p>Methods</p> <p>An "open bore" 1.5T MRI scanner, Siemens Espree, has been installed in the radiotherapy department in near proximity to a treatment unit to enable patient transport between the two installations, and hence use the MRI for patient positioning. The spatial uncertainty caused by the transport was added to the uncertainty originating from the target definition process, estimated through a review of the scientific literature. The uncertainty in the CT-based workflow was estimated through a literature review.</p> <p>Results</p> <p>The systematic uncertainties, affecting all treatment fractions, are reduced from 3-4 mm (1Sd) with a CT based workflow to 2-3 mm with a MR based workflow. The main contributing factor to this improvement is the exclusion of registration between MR and CT in the planning phase of the treatment.</p> <p>Conclusion</p> <p>Treatment planning directly on MR images reduce the spatial uncertainty for prostate treatments.</p

Permanent 125I-seed prostate brachytherapy: early prostate specific antigen value as a predictor of PSA bounce occurrence

<p>Abstract</p> <p>Purpose</p> <p>To evaluate predictive factors for PSA bounce after ¹²⁵I permanent seed prostate brachytherapy and identify criteria that distinguish between benign bounces and biochemical relapses.</p> <p>Materials and methods</p> <p>Men treated with exclusive permanent ¹²⁵I seed brachytherapy from November 1999, with at least a 36 months follow-up were included. Bounce was defined as an increase ≥ 0.2 ng/ml above the nadir, followed by a spontaneous return to the nadir. Biochemical failure (BF) was defined using the criteria of the Phoenix conference: nadir +2 ng/ml.</p> <p>Results</p> <p>198 men were included. After a median follow-up of 63.9 months, 21 patients experienced a BF, and 35.9% had at least one bounce which occurred after a median period of 17 months after implantation (4-50). Bounce amplitude was 0.6 ng/ml (0.2-5.1), and duration was 13.6 months (4.0-44.9). In 12.5%, bounce magnitude exceeded the threshold defining BF. Age at the time of treatment and high PSA level assessed at 6 weeks were significantly correlated with bounce but not with BF. Bounce patients had a higher BF free survival than the others (100% versus 92%, p = 0,007). In case of PSA increase, PSA doubling time and velocity were not significantly different between bounce and BF patients. Bounces occurred significantly earlier than relapses and than nadir + 0.2 ng/ml in BF patients (17 vs 27.8 months, p < 0.0001).</p> <p>Conclusion</p> <p>High PSA value assessed 6 weeks after brachytherapy and young age were significantly associated to a higher risk of bounces but not to BF. Long delays between brachytherapy and PSA increase are more indicative of BF.</p